A Polynomial Time Algorithm for Diophantine Equations in One Variable
نویسندگان
چکیده
We show that the integer roots of of a univariate polynomial with integer coe cients can be computed in polynomial time This re sult holds for the classical i e Turing model of computation and a sparse representation of polynomials i e coe cients and exponents are written in binary and only nonzero monomials are represented
منابع مشابه
Using Sparse Interpolation in Hensel Lifting
The standard approach to factor a multivariate polynomial in Z[x1, x2, . . . , xn] is to factor a univariate image in Z[x1] then lift the factors of the image one variable at a time using Hensel lifting to recover the multivariate factors. At each step one must solve a multivariate polynomial Diophantine equation. For polynomials in many variables with many terms we find that solving these mult...
متن کاملCan a System of Linear Diophantine Equations be Solved in Strongly Polynomial Time?
We demonstrate that the answer to the question posed in the title is “yes” and “no”: “no” if the set of permissible operations is restricted to {+,−,×,/,mod,<}; “yes” if we are also allowed a gcd-oracle as a permissible operation. It has been shown (see [Sto76, MST91]) that no strongly polynomial algorithm exists for the problem of finding the greatest common divisor (gcd) of two arbitrary inte...
متن کاملon ”NUMBER THEORY AND MATHEMATICAL PHYSICS” On recent Diophantine results
Diophantus of Alexandria was a greek mathematician, around 200 AD, who studied mathematical problems, mostly geometrical ones, which he reduced to equations in rational integers or rational numbers. He was interested in producing at least one solution. Such equations are now called Diophantine equations. An example is y − x = 1, a solution of which is (x = 2, y = 3). More generally, a Diophanti...
متن کاملAn Improved Algorithm for Diophantine Equations in One Variable
We present a new algorithm for computing integer roots of univariate polynomials. For a polynomial f in Z[t] we can find the set of its integer roots in a time polynomial in the size of the sparse encoding of f . An algorithm to do this was given in [1]. The paper introduces a polynomial time method for computing sign of f at integral points, and then finds integer roots of f by isolating the r...
متن کاملTopic Proposal: Faltings’ Theorem
A “diophantine equation” is a system of polynomial equations where we restrict the solution set to rational or integral values. The study of diophantine equations is the study of the nature of these integral or rational solution sets. “diophantine geometry” is the study of diophantine equations using the language of algebraic geometry. Specifically, one associates to a diophantine equation the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 27 شماره
صفحات -
تاریخ انتشار 1999